Monte Carlo analysis of percolation of line segments on a square lattice.
نویسندگان
چکیده
A Monte Carlo analysis of percolation of line-segments on a square lattice. Abstract We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases , goes through a minimum and then increases slowly for large segments. We explain this non-monotonic behaviour by a structural change of the percolation clusters. Moreover, it is strongly suggested that these systems do not belong to the universality class of random site percolation.
منابع مشابه
Temporally Disordered Bond Percolation on the Directed Square Lattice.
Simple models of directed bond percolation with temporal disorder are introduced and studied via series expansions and Monte Carlo simulations. Series have been derived for the percolation probability on the directed square lattice. Analysis of the series revealed that the critical exponent b and critical point pc change continuously with the strength of the disorder. Monte Carlo simulation con...
متن کاملA pr 1 99 9 Geometry of fully coordinated , two - dimensional percolation
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same universality class with ordinary percolation statically but not so dynamically. We show that there are large differences in the number and distribution of the in...
متن کاملIrreversible Deposition of Line Segment Mixtures on a Square Lattice: Monte Carlo Study
We have studied kinetics of random sequential adsorption of mixtures on a square lattice using Monte Carlo method. Mixtures of linear short segments and long segments were deposited with the probability p and 1− p, respectively. For fixed lengths of each segment in the mixture, the jamming limits decrease when p increases. The jamming limits of mixtures always are greater than those of the pure...
متن کاملHistogram Monte Carlo Position-Space Renormalization Group: Applications to the Site Percolation
We study site percolation on the square lattice and show that, when augmented with histogram Monte Carlo simulations for large lattices, the cell-to-cell renormalization group approach can be used to determine the critical probability accurately. Unlike the cell-to-site method and an alternate renormalization group approach proposed recently by Sahimi and Rassamdana, both of which rely on ab in...
متن کاملEfficient Monte Carlo algorithm and high-precision results for percolation.
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond occupation probabilities from zero to one in a single run which takes an amount of time scaling linearly with the number of sites on the lattice. We use our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. B, Condensed matter
دوره 50 5 شماره
صفحات -
تاریخ انتشار 1994